Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
391	Robustness of Social Networks: Comparative Results Based on Distance Distributions Paolo Boldi Marco Rosa Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2011-10-20 04:37:07 Networks Network analysis Algebraic graph theory Centrality Small-world network Betweenness centrality Complex network Graph Shortest path problem Graph theory Mathematics Network theory
392	ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-10-30 10:03:20 Induced path Matching Clique Dominating set Interval graph Algebraic topology Line graph Path decomposition Graph theory Chordal graph Graph
393	A Sketch-Based Distance Oracle for Web-Scale Graphs Atish Das Sarma Sreenivas Gollapudi Marc Najork Add to Reading List Source URL: www.wsdm-conference.org Language: English - Date: 2009-12-30 02:03:16 Network theory Network flow Graph Shortest path problem Tree Reachability Connectivity Distance Flow network Graph theory Mathematics Theoretical computer science
394	1 Four Degrees of Separation, Really Paolo Boldi Sebastiano Vigna Dipartimento di Informatica Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2012-05-24 13:25:22 Network theory Social networks Networks Graph Shortest path problem Six degrees of separation Small world experiment Degree distribution Centrality Graph theory Mathematics Theoretical computer science
395	12 Force-Directed Drawing Algorithms Stephen G. Kobourov University of Arizona Add to Reading List Source URL: cs.brown.edu Language: English - Date: 2013-06-24 01:29:28 Graph drawing Force-based algorithms Graph Shortest path problem Degree Path decomposition Layered graph drawing Graph theory Mathematics Theoretical computer science
396	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
397	iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2015-04-07 01:41:51 Network theory Graph connectivity Reachability R-tree Routing Shortest path problem Pruning Distributed data storage Bx-tree Graph theory Mathematics Theoretical computer science
398	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
399	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems